Symbolic dynamics of Boolean control networks
نویسندگان
چکیده
منابع مشابه
Symbolic dynamics of Boolean control networks
We consider Boolean control networks (BCNs), and in particular Boolean networks (BNs), in the framework of symbolic dynamics (SD). We show that the set of state-space trajectories of a BCN is a shift space of finite type (SFT). This observation allows to extend two important analysis tools from SD, namely, the Artin-Mazur zeta function and the topological entropy, to BNs and BCNs. Some of the t...
متن کاملSymbolic Approaches for Finding Control Strategies in Boolean Networks
We present an exact algorithm, based on techniques from the field of Model Checking, for finding control policies for Boolean Networks (BN) with control nodes. Given a BN, a set of starting states, I, a set of goal states, F, and a target time, t, our algorithm automatically finds a sequence of control signals that deterministically drives the BN from I to F at, or before time t, or else guaran...
متن کاملDynamics of Boolean Networks
Boolean networks are special types of finite state timediscrete dynamical systems. A Boolean network can be described by a function from an n-dimensional vector space over the field of two elements to itself. A fundamental problem in studying these dynamical systems is to link their long term behaviors to the structures of the functions that define them. In this paper, a method for deriving a B...
متن کاملDynamics of Boolean Networks
Networks are used to model systems consisting of many interacting units. The topology of networks has been studied extensively while there are still many open questions concerning the dynamics of and on networks. Boolean networks refer to a class of dynamics on networks; it is the simplest possible dynamics which allows for analytical studies and easy computer implementation. Applications of ne...
متن کاملDynamics of Random Boolean Networks
Boolean networks are models of genetic regulatory networks. S. Kauffman based many of his claims about spontaneous self-organization in complex systems on simulations of randomly constructed Boolean networks. Some of these claims are precise mathematical statements. We analyze these statements using combinatorial methods and show that there is partial agreement with some of Kauffman’s conclusio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2013
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2013.05.004